A Remark on Nets of Threshold Elements

نویسنده

  • Wolffried Stucky
چکیده

The symbols, designations and definitions are the same as those in Krohn and Rhodes (1965); tha t article contains complete algebraic characterizations of general and some special nets of threshold elements and of the transition functions associated with them. In Corollary 3.1. (iii) the authors give a criterion for transition functions of Simple McCulloch-Pitts Nets (SMPN) which is necessary but not sufficient. This paper intends to bring a sufficient criterion by addition of another necessary condition. An example may show that equation (3.1) is not sufficient. Let N = /a, b, c}, a ~ b, a ~ c, b ~ c, and the mapf :$ (N) --~ $(N) be defined by

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A remark on boundedness of composition operators between weighted spaces of holomorphic functions on the upper half-plane

In this paper, we obtain a sucient condition for boundedness of composition operators betweenweighted spaces of holomorphic functions on the upper half-plane whenever our weights are standardanalytic weights, but they don't necessarily satisfy any growth condition.

متن کامل

A remark on the means of the number of divisors

‎We obtain the asymptotic expansion of the sequence with general term $frac{A_n}{G_n}$‎, ‎where $A_n$ and $G_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$‎, ‎with $d(n)$ denoting the number of positive divisors of $n$‎. ‎Also‎, ‎we obtain some explicit bounds concerning $G_n$ and $frac{A_n}{G_n}$.

متن کامل

A short remark on the result of Jozsef Sandor

It is pointed out that, one of the results in the recently published article, ’On the Iyengar-Madhava Rao-Nanjundiah inequality and it’s hyperbolic version’ [3] by J´ozsef S´andor is logically incorrect and new corrected result with it’s proof is presented.

متن کامل

On Autonomous Logic Nets of Threshold Elements

A model of autonomous logic nets composed of n threshold elements is presented and several properties of a single threshold element are generalized to this model. The number of these nets is shown to be 2kn (-<k<l) for completely specified machines. The capacity of the net is defined and conjectured to be 2, similar to the case of a single threshold element. P and NPN Manuscript received Octobe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Information and Control

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1967